Correlation coefficient analysis: centrality vs. maximal clique size for complex real-world network graphs
نویسندگان
چکیده
منابع مشابه
On the Distribution of the Maximal Clique Size for the Vertices in Real-world Network Graphs and Correlation Studies
The high-level contributions of this paper are as follows: We modify an existing branch-andbound based exact algorithm (for maximum clique size of an entire graph) to determine the maximal clique size that the individual vertices in the graph are part of. We then run this algorithm on six real-world network graphs (ranging from random networks to scale-free networks) and analyze the distributio...
متن کاملCorrelation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks
The high-level contribution of this paper is a comprehensive analysis of the correlation levels between node centrality (a computationally light-weight metric) and maximal clique size (a computationally hard metric) in random network and scale-free network graphs generated respectively from the well-known Erdos-Renyi (ER) and Barabasi-Albert (BA) models. We use three well-known measures for eva...
متن کاملEvaluation of Correlation Measures for Computationally-Light vs. Computationally-Heavy Centrality Metrics on Real-World Graphs
We identify three different levels of correlation (pairwise relative ordering, network-wide ranking and prediction through linearity) that could be assessed between a computationally-light centrality metric and a computationally-heavy centrality metric for real-world networks. The Kendall's concordance-based correlation measure could be used to quantitatively assess how well we could consider t...
متن کاملAssortativity Analysis of Real-World Network Graphs based on Centrality Metrics
Assortativity index (A. Index) of real-world network graphs has been traditionally computed based on the degree centrality metric and the networks were classified as assortative, dissortative or neutral if the A. Index values are respectively greater than 0, less than 0 or closer to 0. In this paper, we evaluate the A. Index of real-world network graphs based on some of the commonly used centra...
متن کاملDistribution of maximal clique size of the vertices for theoretical small-world networks and real-world networks
Our primary objective in this paper is to study the distribution of the maximal clique size of the vertices in complex networks. We define the maximal clique size for a vertex as the maximum size of the clique that the vertex is part of and such a clique need not be the maximum size clique for the entire network. We determine the maximal clique size of the vertices using a modified version of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Network Science
سال: 2016
ISSN: 2048-2175,2048-2183
DOI: 10.1504/ijns.2016.073560